Markov Chain Monte Carlo Random Testing

نویسندگان

  • Bo Zhou
  • Hiroyuki Okamura
  • Tadashi Dohi
چکیده

This paper proposes a software random testing scheme based on Markov chain Monte Carlo (MCMC) method. The significant issue of software testing is how to use the prior knowledge of experienced testers and the information obtained from the preceding test outcomes in making test cases. The concept of Markov chain Monte Carlo random testing (MCMCRT) is based on the Bayes approach to parametric models for software testing, and can utilize the prior knowledge and the information on preceding test outcomes for their parameter estimation. In numerical experiments, we examine effectiveness of MCMCRT with ordinary random testing and adaptive random testing.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

MATHEMATICAL ENGINEERING TECHNICAL REPORTS Graver Basis for an Undirected Graph and Its Application to Testing the Beta Model of Random Graphs

In this paper we give an explicit and algorithmic description of Graver basis for the toric ideal associated with a simple undirected graph and apply the basis for testing the beta model of random graphs by Markov chain Monte Carlo method.

متن کامل

Graver basis for an undirected graph and its application to testing the beta model of random graphs

In this paper, we give an explicit and algorithmic description of Graver basis for the toric ideal associated with a simple undirected graph and apply the basis for testing the beta model of random graphs by Markov chain Monte Carlo method.

متن کامل

Multidimensional Integration of a Positive Function Using Markov Chain Monte Carlo

A new Markov Chain Monte Carlo algorithm that allows parallel processing has been described in a previous paper (“Markov Chain Monte Carlo Calculations Allowing Parallel Processing Using a Variant of the Metropolis Algorithm”) that appeared in this journal in 2010. In this second follow-on paper, the problem of calculating the normalization integral of the distribution function is considered. I...

متن کامل

Chapter 4 : Generating Random Variables

Many of the methods in computational statistics require the ability to generate random variables from known probability distributions. This is at the heart of Monte Carlo simulation for statistical inference (Chapter 6), bootstrap and resampling methods (Chapters 6 and 7), Markov chain Monte Carlo techniques (Chapter 11), and the analysis of spatial point processes (Chapter 12). In addition, we...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010